Computing the First Eigenpair of the p-Laplacian via Inverse Iteration of Sublinear Supersolutions

نویسندگان

  • Rodney Josué Biezuner
  • Jed Brown
  • Grey Ercole
  • Eder Marinho Martins
چکیده

We introduce an iterative method for computing the first eigenpair (λp, ep) for the pLaplacian operator with homogeneous Dirichlet data as the limit of (μq,uq) as q → p −, where uq is the positive solution of the sublinear Lane-Emden equation −∆puq = μqu q−1 q with same boundary data. The method is shown to work for any smooth, bounded domain. Solutions to the Lane-Emden problem are obtained through inverse iteration of a supersolution which is derived from the solution to the torsional creep problem. Convergence of uq to ep is in the C 1-norm and the rate of convergence of μq to λp is at least O (p− q).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive solution for Dirichlet‎ ‎$‎‎p(t)‎$‎-Laplacian BVPs

In this paper we provide‎ ‎existence results for positive solution to‎ ‎Dirichlet p(t)-Laplacian boundary value problems‎. ‎The sublinear and‎ ‎superlinear cases are considerd‎.

متن کامل

Superlinear Convergence Rates for the Lanczos Method Applied to Elliptic Operators

This paper investigates the convergence of the Lanczos method for computing the smallest eigenpair of a selfadjoint elliptic diierential operator via inverse iteration (without shifts). Superlinear convergence rates are established, and their sharpness is investigated for a simple model problem. These results are illustrated numerically for a more diicult problem.

متن کامل

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

Efficient initials for computing maximal eigenpair

This paper introduces some efficient initials for a well-known algorithm (an inverse iteration) for computing the maximal eigenpair of a class of real matrices. The initials not only avoid the collapse of the algorithm but are also unexpectedly efficient. The initials presented here are based on our analytic estimates of the maximal eigenvalue and a mimic of its eigenvector for many years of ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2012